Two stage traffic scheduling

ABSTRACT

A first traffic flow directed to a first wireless device is received. A second traffic flow directed to a second wireless device is received. These traffic flows comprise at least a first service flow classification and a second service flow classification. The first traffic flow and the second traffic flow are scheduled based on the first service flow classification and the second flow classification. This produces first and second device scheduled flows. The first and second device scheduled flows are classified into a plurality of flow classes. The plurality of flow classes comprises at least a first flow class and a second flow class. The first scheduled flow and the second scheduled flow are scheduled based on the first flow class and the second flow class. This produces an aggregate traffic flow.

TECHNICAL BACKGROUND

Wireless communication may be used as a means of accessing a network.Wireless communication has certain advantages over wired communicationsfor accessing a network. One of those advantages is a lower cost ofinfrastructure to provide access to many separate locations or addressescompared to wired communications. This is the so-called “last mile”problem. Another advantage is mobility. Wireless communication devices,such as cell phones, are not tied by wires to a fixed location. To usewireless communication to access a network, a customer needs to have atleast one transceiver in active communication with another transceiverthat is connected to the network.

To facilitate wireless communications, the Institute of Electrical andElectronics Engineers (IEEE) has promulgated a number of wirelessstandards. These include the 802.11 (WiFi) standards and the 802.16(WiMAX) standards. Likewise, the International Telecommunication Union(ITU) has promulgated standards to facilitate wireless communications.This includes TIA-856, which is also known as Evolution-Data Optimized(EV-DO). The European Telecommunications Standards Institute (ETSI) hasalso promulgated a standard known a long term evolution (LTE).Additional standards such as the fourth generation communication system(4G) are also being pursued. All of these standards pursue the aim ofproviding a comprehensive IP solution where voice, data and streamedmultimedia can be given to users on an “anytime, anywhere” basis. Thesestandards also aim to provide higher data rates than previousgenerations. All of these standards may include specifications forvarious aspects of wireless communication with a network includingprocesses for registering on the network, carrier modulation, frequencybands of operation, and message formats.

Overview

A method of managing network traffic is disclosed. A first traffic flowdirected to a first wireless device is received. A second traffic flowdirected to a second wireless device is received. These traffic flowscomprise at least a first service flow classification and a secondservice flow classification. The first traffic flow is scheduled basedon the first service flow classification and the second flowclassification. This produces a first device scheduled flow. The secondtraffic flow is schedule based on the first service flow classificationand the second flow classification. This produces a second devicescheduled flow.

The first device scheduled flow and the second device scheduled flow areclassified into a plurality of flow classes. The plurality of flowclasses comprise at least a first flow class and a second flow class.The first scheduled flow and the second scheduled flow are scheduledbased on the first flow class and the second flow class. This producesan aggregate traffic flow.

A method of scheduling backhaul traffic to a plurality of wirelessdevices is disclosed. A first packet and a second packet that aredirected to a first wireless device are received. The first packet is ofa first traffic class. The second packet is of a second traffic class.The first packet is placed into a first queue based on the first trafficclass. The second packet is placed into a second queue based on thesecond traffic class. The first packet is removed from the first queueand the second packet is removed from the second queue in an order thatis based on at least the first traffic class, the second traffic class,and an amount of space left in at least the first queue.

The first packet is classified into a first flow classification. Thesecond packet is classified into a second flow classification. The firstpacket is placed into a first flow class queue based on the first flowclassification. The second packet is placed into a second flow classqueue based on the second flow classification. The first packet and thesecond packet are sent to a backhaul link in an order that is based onat least the first flow class, the second flow class, and an amount ofspace left in the first flow queue.

A method of scheduling backhaul traffic directed to a plurality ofwireless devices is disclosed. An incoming traffic flow comprising afirst device flow and a second device flow is received. The incomingtraffic flow is separated into the first device flow and the seconddevice flow. The first device flow is separated into a first servicefirst device flow, and a second service first device flow. The seconddevice flow is separated into a first service second device flow, and asecond service second device flow. A first service first device flowpacket is sent to a first per-hop behavior queue. A second service firstdevice flow packet is sent to a second per-hop behavior queue. Thesepackets are sent in an order that is based on a first serviceclassification associated with the first service first device flow, anda second service classification associated with the second service firstdevice flow. The first service first device flow packet and the secondservice first device flow packet are sent to a backhaul link in an orderthat is based on a per-hop behavior associated with the first per-hopbehavior queue.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a two stage traffic schedulingsystem.

FIG. 2 is a block diagram illustrating a two stage traffic schedulingsystem.

FIG. 3 is a flowchart illustrating a method of managing network traffic.

FIG. 4 is a flowchart illustrating a method of scheduling backhaultraffic to a plurality of wireless devices.

FIG. 5 is a flowchart illustrating a method of scheduling backhaultraffic directed to a plurality of wireless devices.

FIG. 6 is a block diagram of a computer system.

DETAILED DESCRIPTION

FIG. 1 is a block diagram illustrating a two stage traffic schedulingsystem. In FIG. 1, traffic scheduling system 100 comprises: accessnetwork 101; access gateway 110; network 120; base station 130; basestation 131; wireless device 140; wireless device 141; wireless link145; and wireless link 146. Access network 101 includes access gateway110, base station 130, and base station 131.

Network 120 is operatively coupled to access gateway 110. Access gateway110 is operatively coupled to base station 130 and base station 131 viabackhaul links. Base station 130 is operatively coupled to wirelessdevice 140 and wireless device 141 via wireless links 145 and 146,respectively. Thus, network 120 may send traffic to wireless devices 140and 141 via access network 101, access gateway 110, and base station130.

Access network 101 may comprise a computer, a network, or a collectionof computers and networks that couple, link, or otherwise operativelyprovide wireless device 140 or wireless device 141 with communicationservice. It should be understood that access network 101 may comprisesecondary data networks. For example, access network 101 may include abackhaul network, a local network, a long distance network, a packetnetwork, or any combination thereof, as well as other types of networks.Access network 101 may be or include one or more of an access servicenetwork (ASN), an access service network gateway (ASN-GW), wirelesslocal access network access gateway (WAG), packet data gateway (PDG),mobile switching center (MSC) and packet data serving node (PDSN).

Access network 101 includes base stations 130 and 131. Base station 130or base station 131 may be any wireless system that provides the airinterface to wireless devices 140 and 141 and communication connectivitywith access gateway 110. Examples of base station 130 or base station131 include, base transceiver stations (BTSs), radio base stations(RBSs), Node B, enhanced Node B (eNBs) and others. Base station 130 orbase station 131 may include a number of elements known to those skilledin the art comprising a transceiver, power amplifier, combiner,duplexer, antenna and control function.

Wireless device 140 or wireless device 141 may be any device, system,combination of devices, or other such communication platform capable ofcommunicating with access gateway 110 via base station 130. Wirelessdevices 140 and 141 may be, for example, an a mobile phone, a wirelessphone, a wireless modem, a personal digital assistant (PDA), a voiceover internet protocol (VoIP) phone, a voice over packet (VOP) phone, ora soft phone, as well as other types of devices or systems that canexchange audio or data with access gateway 110 via base station 130.Other types of communication platforms are possible.

Wireless device 140 and wireless device 141 may establish communicationsessions with access gateway 110 in order to receive communicationservices from network 120. These services may include voice services anddata services. These services may include but are not limited totelephone services, long distance services, mobile voice services,mobile data services, push-to-talk services, internet services, webbrowsing, email, pictures, picture messaging, video, video messaging,audio, voicemail, music, MP3's, ring tones, stock tickers, news alerts,and so on.

To receive one or more of these services, traffic flows may be directedto wireless device 140 or wireless device 141 from network 120. Thesetraffic flows may have one or more service flow classifications. Forexample, network 120 may direct a traffic flow to wireless device 140that includes a service traffic flow classification for voice serviceand a service traffic flow classification for a web browsing service.Likewise, network 120 may direct a traffic flow to wireless device 141that includes a service traffic flow classification for voice serviceand a service traffic flow classification for a web browsing service.The service traffic flow classifications for voice service and for webbrowsing service may have different quality of service (QoS)requirements. In an embodiment, the traffic flows for these serviceshave different service flow classifications.

In an embodiment, the service flow classifications may include wirelesstraffic classifications. For example, for WiMAX wireless communicationthere are wireless traffic quality of service classifications thatinclude: unsolicited grant service (UGS), real time polling service(rtPS), extended real time polling service (ertPS), non-real timepolling service (nRTPS), and best effort (BE).

Access gateway 110 may receive the traffic flows directed to wirelessdevice 140 and wireless device 141 from network 120. Access gateway 110or access network 101 may schedule the traffic flow for each wirelessdevice 140 and 141 based on the service flow classifications. Byindependently scheduling the traffic flows based on the service flowclassifications for wireless device 140 and wireless device 141, accessgateway 110 or access network 101 creates two device scheduled flows(e.g., one each for wireless device 140 and wireless device 141.)

In an embodiment, access gateway 110 may separate the traffic directedto wireless device 140 according to the WiMAX QoS classifications.Traffic with different WiMAX QoS classifications may then be placed intodifferent queues. Traffic may then be scheduled from these queues forwireless device 140 using a scheduling algorithm.

Examples of scheduling algorithms that may be used are the“leaky-bucket” algorithm, the “token-bucket” algorithm, a deficitweighted round robin algorithm, and weighted round robin (WRR). Thescheduling algorithm may also include an algorithm that determines howto handle queue overflows. Examples of algorithms designed to handlequeue overflows (a.k.a. buffer tail drops) include random earlydetection (RED), weighted RED (WRED), and RED In/Out (RIO).

Access gateway 110 may also separate the traffic directed to wirelessdevice 141 according to the WiMAX QoS classifications. As with wirelessdevice 140, traffic with different WiMAX QoS classifications may then beplaced into different queues. The queues for wireless device 141 may beassociated with the same service classifications as the queues used forwireless device 140. However, they are different from the queues forwireless device 140. Thus, the traffic flows for wireless device 140 and141 are scheduled from their respective service flow queues independentof each other. This independent scheduling creates independent devicescheduled flows.

Once traffic is independently scheduled based on the service flowclassifications for wireless device 140 and wireless device 141, accessnetwork 101 or access gateway 110 may classify the device scheduledflows into flow classes that are different from the service flowclassifications used previously.

In an embodiment, access network 101 or access gateway 110 classifiesthe device scheduled flows associated with wireless device 140 andwireless device 141 into flow classes that include one or more of thedifferentiated services (DiffServ) per-hop behavior classifications.DiffServ per-hop behavior (PHB) classifications are described inRFC-2474, RFC-2475, RFC-2597, and RFC-3246, which are herebyincorporated herein by reference. These documents are available from TheInternet Engineering Task Force at http://www.ietf.org/. DiffServper-hop behavior classifications may be grouped into an expeditedforwarding (EF) group, an assured forwarding (AF) group, a classselector group, and a default group.

Once the device scheduled flows are classified into flow classes, accessgateway 110 or access network 101 schedules the device scheduled flowsthat are directed to a base station based on the flow classes. Forexample, based on the flow classes assigned to the device scheduledflows associated with wireless device 140 and wireless device 141,access gateway 110 or access network 101 may schedule these devicescheduled flows to produce an aggregate traffic flow that is sent tobase station 130. Thus, the traffic flows directed to wireless devices140 and 141 are first scheduled according to a service flowclassification scheme independent of each other. Then, the resultantdevice scheduled flows are scheduled according to a flow class scheme.The aggregate traffic flow is then sent to base station 130 fortransmission to wireless devices 140 and 141.

FIG. 2 is a block diagram illustrating a two stage traffic schedulingsystem. In FIG. 2, traffic scheduling system 200 comprises: schedulingsystem 210, network 220, and backhaul link 270. Scheduling system 210includes separation and classification 230. Scheduling system 210includes a plurality of device flow scheduling functions 240-241. Deviceflow scheduling function 240 includes a plurality of flow queues 245numbered 1 to N. Device flow scheduling function 241 includes aplurality of flow queues 246 numbered 1 to P. Scheduling system 210includes a plurality of device flow classification functions 250-251.Scheduling system 210 includes a plurality of flow class scheduling 260.Flow class scheduling 260 includes a plurality of flow class queues 261numbered 1 to Q.

Separation and classification 230 is operatively coupled to network 220.Separation and classification receives traffic from network 220 to bescheduled by scheduling system 210. Separation and classification 230 isoperatively coupled to device flow scheduling function 240. Inparticular, separation and classification 230 is operatively coupled toeach of the plurality of flow queues 245. Separation and classification230 is operatively coupled to device flow scheduling function 241. Inparticular, separation and classification 230 is operatively coupled toeach of the plurality of flow queues 246. Separation and classification230 separates traffic from network 220 by the device that the traffic isdirected to. Accordingly, there is a device flow scheduling function240-241 for each device receiving traffic from network 220.

Separation and classification 230 also classifies the traffic fromnetwork 220 into service classifications. These service classificationsmay be the wireless service classifications described previously.

Separation and classification 230 sends the traffic from network 220 tothe appropriate device flow scheduling function 240-241 and one of theplurality of flow queues 245-246. Thus, for each device and serviceclassification combination, there is a one of the plurality of flowqueues 245-246.

Device flow scheduling functions 240 and 241 schedule the traffic out ofthe plurality of flow queues 245 and 246, respectively. Device flowscheduling functions 240 and 241 may schedule the traffic out of theplurality of flow queues 245 and 246 using a scheduling algorithmdescribed previously.

Device flow scheduling functions 240 and 241 schedule the traffic out ofthe plurality of flow queues 245 and 246 independent of each other.Device flow scheduling functions 240 and 241 send the traffic they havescheduled to device flow classification 250 and 251, respectively.

Device flow classification 250 and 251 classify the scheduled trafficthey receive from device flow scheduling functions 240 and 241,respectively, into flow classes. These flow classes may be the DiffServclasses described previously.

Device flow classification 250 and 251 send the scheduled traffic to theappropriate one of the plurality of flow class queues 261 in flow classscheduling 260. Thus, the scheduled traffic received from device flowtraffic classification 250 and 251 by device flow classification 250 and251 is combined into an appropriate one of the plurality of flow classqueues 261 to be scheduled by flow class scheduling 260.

Flow class scheduling 260 schedules the traffic out of the plurality offlow class queues 261. Flow class scheduling 260 schedules the trafficout of the plurality of flow class queues 261 based on the per-hopbehavior associated with each of the plurality of flow class queues 261.Flow class scheduling 260 may schedule the traffic out of the pluralityof flow class queues 261 using a scheduling algorithm describedpreviously. Flow class scheduling 260 sends the traffic it has scheduledto backhaul link 270.

FIG. 3 is a flowchart illustrating a method of managing network traffic.The steps illustrated in FIG. 3 may be performed by traffic schedulingsystem 100 or traffic scheduling system 200.

A first traffic flow that includes a plurality of service flows and isdirected to a first device is received (302). For example, accessnetwork 101 may receive a traffic flow from network 120 that is directedto wireless device 140. This traffic flow may include traffic that maybe classified into more than one service flow. For example, the trafficmay be classified into service flows that include one or more of: UGS,rtPS, ertPS, nRTPS, and BE, described previously.

A second traffic flow that includes the plurality of service flows andis directed to a second device is received (304). For example, accessnetwork 101 may receive a traffic flow from network 120 that is directedto wireless device 141. This traffic flow may include traffic that maybe classified into the same service flow classifications as the flowsdirected to wireless device 140.

The first traffic flow is scheduled based on the plurality of serviceflows to produce a first device scheduled flow (306). For example,access network 101 may schedule the traffic received from network 120that is directed to wireless device 140 based on the service flowclassification associated with each packet. The resulting flow ofscheduled packets can comprise the device scheduled flow for wirelessdevice 140.

The second traffic flow is scheduled based on the plurality of serviceflows to produce a second device scheduled flow (308). For example,access network 101 may schedule the traffic received from network 120that is directed to wireless device 141 based on the service flowclassification associated with each packet. The resulting flow ofscheduled packets can comprise the device scheduled flow for wirelessdevice 141.

The first device scheduled flow and the second device scheduled flow areclassified into a plurality of flow classes (310). For example, accessnetwork 101 may classify the packets in the device scheduled flow forwireless devices 140 and 141 into DiffServ per-hop behavior classesdescribed previously.

The first device scheduled flow and the second device scheduled flow arescheduled based on the plurality of flow classes (312). For example,access network 101 may schedule the packets in the device scheduledflows for wireless devices 140 and 141 based upon their associatedDiffServ per-hop behavior classes. The scheduled packets from theaggregation of the device scheduled flows for wireless devices 140 and141 may then be sent to base station 130 via a backhaul link.

FIG. 4 is a flowchart illustrating a method of scheduling backhaultraffic to a plurality of wireless devices. The steps illustrated inFIG. 4 may be performed by traffic scheduling system 100 or trafficscheduling system 200.

A first packet and a second packet that are directed to a first wirelessdevice are received (402). For example, access network 101 may receivepackets from network 120 that are directed to wireless device 140. Inanother example, scheduling system 210 may receive packets from network220.

The first packet is placed into a first queue based on a first trafficclass (404). For example, separation and classification 230 may place apacket into one of the plurality of flow queues 245 based on both thedevice that the packet is directed to and the traffic class associatedwith that packet. In another example, separation and classification 230may place the first packet into flow queue 248 based on both the devicethat the first packet is directed to and the traffic class associatedwith the first packet. In an embodiment, the first packet may be placedinto flow queue 248 based on an associated classification that includesone or more of: UGS, rtPS, ertPS, nRTPS, and BE, described previously.

The second packet is placed into a second queue based on a secondtraffic class (406). For example, separation and classification 230 mayplace a packet into one of the plurality of flow queues 245 based thetraffic class associated with that packet. In an embodiment, the secondpacket may be placed into the second queue that is associated with adifferent traffic classification than the traffic classificationassociated with the first queue. In another example, separation andclassification 230 may place the second packet into flow queue 249 basedon both the device that the second packet is directed to and the trafficclass associated with the second packet. In an embodiment, the secondpacket may be placed into flow queue 249 based on an associatedclassification that includes one or more of: UGS, rtPS, ertPS, nRTPS,and BE, described previously.

The first packet and the second packet are removed from the first queueand the second queue, respectively, in an order that is based on thefirst and second traffic classes and an amount of space left in thefirst or second queue (408). For example, a packet may be removed bydevice flow scheduling function 240 from flow queue #1 248 beforeanother packet is removed from flow queue #2 249 based on the trafficclasses associated with flow queue 248 and flow queue 249 and an amountof space left in flow queue 248.

The first packet is classified into a first flow classification (410).For example, a packet that was sent to device flow classification 250 bydevice flow scheduling 240 may be classified by device flowclassification 250 into a flow classification. In an embodiment, thisfirst flow classification is at least one of the DiffServ per-hopbehavior classes described previously.

The second packet is classified into a second flow classification (412).For example, a packet that was sent to device flow classification 250 bydevice flow scheduling 240 may be classified by device flowclassification 250 into a flow classification. In an embodiment, thissecond flow classification is at least one of the DiffServ per-hopbehavior classes described previously.

The first packet is placed into a first flow class queue (414). Forexample, device flow classification 250 may place the first packet intoflow class queue 266 because flow class queue 266 is associated with thefirst flow classification.

The second packet is placed into a second flow class queue (416). Forexample, device flow classification 250 may place the second packet intoflow class queue 267 because flow class queue 267 is associated with thesecond flow classification.

The first packet and the second packet are sent in an order that isbased on the first and second flow classifications and an amount ofspace left in the first or second flow class queues (418). For example,flow class scheduling 260 may send the first packet and the secondpacket to backhaul link 270 in an order that is based on the first andsecond flow classification and an amount of space left in flow classqueue 266 or flow class queue 267. Flow class scheduling 260 may sendthe first and second packets in an order that is determined by ascheduling algorithm such as the scheduling algorithms disclosedpreviously.

FIG. 5 is a flowchart illustrating a method of scheduling backhaultraffic directed to a plurality of wireless devices. The stepsillustrated in FIG. 5 may be performed by traffic scheduling system 100or traffic scheduling system 200.

An incoming traffic flow is received (502). For example, access network101 may receive a traffic flow from network 120. The incoming trafficflow is separated into a first device flow and a second device flow(506). For example, access network 101 may separate the incoming trafficflow into a flow directed to wireless device 140 and a flow directed towireless device 141.

The first device flow is separated into at least two service flows(508). For example, access network may separate the flow directed towireless device 140 into two or more service flow classifications. In anembodiment, the at least two service flows may include one or more of:UGS, rtPS, ertPS, nRTPS, and BE, described previously.

The second device flow is separated into at least two service flows(510). For example, access network may separate the flow directed towireless device 141 into two or more service flow classifications. In anembodiment, the at least two service flows may include one or more of:UGS, rtPS, ertPS, nRTPS, and BE, described previously.

A first packet and a second packet from the first device flow are sentto per-hop behavior queues in an order based on an associated serviceflow classification (512). For example, access network 101 may send afirst packet before a second packet to a per-hop behavior queue becausethe first packet came from a service flow that has a higher prioritythan the service flow the second packet came from.

The first packet and the second packet are sent to a backhaul link in anorder that is based on a per-hop behavior associated with a per-hopbehavior queue (514). For example, access network 101 may send a firstpacket before a second packet to base station 130 via a backhaul linkbecause the first packet came from a per-hop behavior queue that has ahigher priority than the per-hop behavior queue that the second packetcame from. In an embodiment, the first and second packets may be sent inan order that is determined by a scheduling algorithm such as thescheduling algorithms disclosed previously.

The methods, systems, devices, queues, links, networks, and basestations described above may be implemented with, contain, or beexecuted by one or more computer systems. The methods described abovemay also be stored on a computer readable medium. Many of the elementsof traffic scheduling system 100 and traffic scheduling system 200 maybe, comprise, or include computers systems. This includes, but is notlimited to: access network 101; access gateway 110; network 120; basestation 130; base station 131; wireless device 140; wireless device 141;access gateway 110, base station 130, base station 131; schedulingsystem 210; network 220; and, backhaul link 270.

FIG. 6 illustrates a block diagram of a computer system. Computer system600 includes communication interface 620, processing system 630, anduser interface 660. Processing system 630 includes storage system 640.Storage system 640 stores software 650. Processing system 630 is linkedto communication interface 620 and user interface 660. Computer system600 could be comprised of a programmed general-purpose computer,although those skilled in the art will appreciate that programmable orspecial purpose circuitry and equipment may be used. Computer system 600may be distributed among multiple devices that together compriseelements 620-660.

Communication interface 620 could comprise a network interface, modem,port, transceiver, or some other communication device. Communicationinterface 620 may be distributed among multiple communication devices.Processing system 630 could comprise a computer microprocessor, logiccircuit, or some other processing device. Processing system 630 may bedistributed among multiple processing devices. User interface 660 couldcomprise a keyboard, mouse, voice recognition interface, microphone andspeakers, graphical display, touch screen, or some other type of userdevice. User interface 660 may be distributed among multiple userdevices. Storage system 640 may comprise a disk, tape, integratedcircuit, server, or some other memory device. Storage system 640 may bedistributed among multiple memory devices.

Processing system 630 retrieves and executes software 650 from storagesystem 640. Software 650 may comprise an operating system, utilities,drivers, networking software, and other software typically loaded onto acomputer system. Software 650 may comprise an application program,firmware, or some other form of machine-readable processinginstructions. When executed by processing system 630, software 650directs processing system 630 to operate as described herein.

The above description and associated figures teach the best mode of theinvention. The following claims specify the scope of the invention. Notethat some aspects of the best mode may not fall within the scope of theinvention as specified by the claims. Those skilled in the art willappreciate that the features described above can be combined in variousways to form multiple variations of the invention. As a result, theinvention is not limited to the specific embodiments described above,but only by the following claims and their equivalents.

1. A method of scheduling backhaul traffic directed to a plurality ofwireless devices, comprising: receiving an incoming traffic flowcomprising a first device flow and a second device flow; separating theincoming traffic flow into the first device flow and the second deviceflow; separating at a first scheduler the first device flow into a firstservice first device flow comprising at least one first service firstdevice flow packet and a second service first device flow comprising atleast one second service first device flow packet; separating at asecond scheduler the second device flow into a first service seconddevice flow comprising at least one first service second device flowpacket and a second service second device flow comprising at least onesecond service second device flow packet; sending a first service firstdevice flow packet to a first per-hop behavior queue and a secondservice first device flow packet to a second per-hop behavior queue inan order based on a first service classification associated with thefirst service first device flow and a second service classificationassociated with the second service first device flow; sending a firstservice second device flow packet to the first per-hop behavior queueand a second service second device flow packet to the second per-hopbehavior queue in an order based on the first service classificationassociated with the first service second device flow and the secondservice classification associated with the second service second deviceflow; and, sending the first service first device flow packet and thefirst service second device flow packet from the first per-hop behaviorqueue, and the second service first device flow packet and the secondservice second device flow packet from the second per-hop behavior queueto a backhaul link in an order based on a first per-hop behaviorassociated with the first per-hop behavior queue and a second per-hopbehavior associated with the second per-hop behavior queue.
 2. Themethod of claim 1, wherein the first service first device flow, thesecond service first device flow, the first service second device flow,and the second service second device flow are mapped to wireless trafficclassifications.
 3. The method of claim 2, wherein the wireless trafficclassifications comprise at least two WiMAX traffic classes.
 4. Themethod of claim 3, wherein the WiMAX traffic classes include two or moreof unsolicited grant service (UGS), extended real time polling server(ertPS), real time polling service (rtPS), non-real time polling service(nRTPS), and best effort (BE).
 5. The method of claim 1, wherein thefirst service classification and the second service classificationinclude at least one DiffServ per-hop behavior classes.
 6. The method ofclaim 5, wherein the DiffServ per-hop behavior classes includes aper-hop behavior class selected from at least one of: an expeditedforwarding per-hop behavior group, an assured forwarding group, adefault group, and a class selector group.